Nuprl Lemma : cr-output-subtype 11,40

es:ES, Config:AbsInterface(chain_config()), Cmd:Type, Sys:AbsInterface(chain_sys(Cmd)).
E(Output) r E(Sys(valid)) 
latex


Definitionss = t, t  T, x:AB(x), x:AB(x), EState(T), a:A fp B(a), f(a), Id, , strong-subtype(A;B), P  Q, Type, EqDecider(T), Unit, left + right, IdLnk, x:A  B(x), EOrderAxioms(Epred?info), kindcase(ka.f(a); l,t.g(l;t) ), Knd, loc(e), kind(e), Msg(M), type List, , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), r  s, e < e', , b, constant_function(f;A;B), SWellFounded(R(x;y)), , pred!(e;e'), x,yt(x;y), Void, x:A.B(x), Top, S  T, suptype(ST), first(e), A, <ab>, pred(e), x.A(x), xt(x), P & Q, chain_config(), E, ES, AbsInterface(A), chain_sys(Cmd), E(X), tail-dcdr{i:l}(es;Config), Sys(valid), (I|p), {x:AB(x)} , let x,y = A in B(x;y), t.1, P  Q, P  Q, f(x)?z, f  g, loc(e), vartype(i;x), state@i, State(ds), State(ds), True, T, Output, Dec(P), e<e'.P(e), cctail?(x), X(e), e  X, case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi , ff, inr x , "$token", inl x , tt, Atom, False, A c B, (e <loc e')
Lemmases-E-interface-restrict, es-locl wf, existse-before wf, es-loc wf, false wf, btrue wf, bfalse wf, cctail? wf, es-interface-val wf, es-interface-val wf2, es-is-interface wf, tail-dcdr wf, sys-valid wf, squash wf, true wf, es-interface wf, event system wf, es-E-interface wf, chain sys wf, es-E wf, chain config wf, deq wf, EOrderAxioms wf, kind wf, Msg wf, nat wf, val-axiom wf, cless wf, qle wf, bool wf, Knd wf, kindcase wf, IdLnk wf, constant function wf, loc wf, not wf, assert wf, first wf, top wf, unit wf, pred! wf, strongwellfounded wf, member wf, rationals wf, Id wf, EState wf, subtype rel wf

origin